915A - Garden - CodeForces Solution

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define fi first
#define se second
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define pb push_back
#define yes {cout<<"Yes"<<endl;return;}
#define no {cout<<"No"<<endl;return;}
#define cntbit __builtin_popcountll
#define pii pair<int,int>
#define vii vector<pair<int,int>>
using namespace std;
const int mod = 1000000007;
const int N = 1<<10;
void add(int &a,int b){
    a+=b;
    if(a>=mod) a-=mod;
}
int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
int qmi(int a,int b){
    int res=1;
    for(;b;b>>=1){
        if(b&1) res=res*a%mod;
        a=a*a%mod; 
    }return res;
}
void solve(){
    int n,k;cin>>n>>k;
    int mx=-1;rep(i,1,n+1){
        int x;cin>>x;
        if(k%x==0) mx=max(mx,x);
    }cout<<k/mx<<endl;
}
signed main(){
    ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
    int t=1;//cin>>t;
    while(t--){
        solve();
    }
}